Using chemical organization theory for model checking
نویسندگان
چکیده
منابع مشابه
Using chemical organization theory for model checking
MOTIVATION The increasing number and complexity of biomodels makes automatic procedures for checking the models' properties and quality necessary. Approaches like elementary mode analysis, flux balance analysis, deficiency analysis and chemical organization theory (OT) require only the stoichiometric structure of the reaction network for derivation of valuable information. In formalisms like Sy...
متن کاملChemical Organization Theory as a Theoretical Base for Chemical Computing
In chemical computing, a theoretical analysis to cope with the emergent behavior is required. In this paper, we exemplified with xor logic gate and flip-flop circuit how chemical organization theory can help in designing and understanding chemical computing systems. The reaction network implementing the boolean computation is decomposed into a hierarchical self-maintaining sub-network (organiza...
متن کاملAutomatic Symmetry Detection for Model Checking Using Computational Group Theory
We present an automatic technique for the detection of structural symmetry in a model directly from its Promela specification. Our approach involves finding the static channel diagram of the model, a graphical representation of channel-based system communication; computing the group of symmetries of this diagram; and computing the largest possible subgroup of these symmetries which induce autom...
متن کاملthe use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولAutomata Theory and Model Checking
We study automata on infinite words and their applications in system specification and verification. We first introduce Büchi automata and survey their closure properties, expressive power, and determinization. We then introduce additional acceptance conditions and the model of alternating automata. We compare the different classes of automata in terms of expressive power and succinctness, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2009
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btp332